V. Constraint Logic Programming Approach to Optimization
نویسندگان
چکیده
منابع مشابه
Logic, Optimization, and Constraint Programming
Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how these ways can be combined. It sketches the intellectu...
متن کاملLogic and Constraint Logic Programming for Distributed Constraint Optimization
The field of Distributed Constraint Optimization Problems (DCOPs) has gained momentum, thanks to its suitability in capturing complex problems (e.g., multi-agent coordination and resource allocation problems) that are naturally distributed and cannot be realistically addressed in a centralized manner. The state of the art in solving DCOPs relies on the use of ad-hoc infrastructures and ad-hoc c...
متن کاملA Rewrite Approach for Constraint Logic Programming
Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the uniication mechanism used in Prolog, by a more general operation called constraint satisfaction. This yields a more eecient evaluation process due to the use of appropriate algorithms designed speciically for a given constraint domain. On the other hand, it is known that pure logic programs can be rep...
متن کاملA Constraint Logic Programming Approach to Examination Scheduling
The scheduling of exams in institutions of higher education is a large, highly constrained and complex problem. The recent advent of modularity in many universities has resulted in an increase of the complexity of the problem, making the manual achievement of an acceptable solution a tedious and sometimes almost impossible problem. Examination scheduling is the process of assigning exams to tim...
متن کاملA Constraint Logic Programming Approach to the Crew Rostering Problem
In this paper, we present a constraint based approach to the Crew Rostering Problem. A solution to this problem is the optimal sequencing of a given set of duties into rosters in order to satisfy a set of constraints. The optimality criterion concerns the minimization of the number of crews needed to cover the duties. This kind of problem has been traditionally solved with Operations Research (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1993
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.113.2_79